From London to Hanoi and back — graphs for neuropsychology
نویسنده
چکیده
Since Hamilton’s Icosian Game, graphs have been used to represent mathematical puzzles. One of the most famous ones, the Tower of Hanoi (TH), is very popular in psychological tests. However, until quite recently the mathematical theory of the underlying graph structure for this and related puzzles like the Tower of London has not been fully exploited. We present the results of a project which aimed at providing neuropsychologists with a computerized test tool which makes use of the mathematical analysis of the so-called tower puzzles. It is hoped that they can be utilized to measure cognitive skills for diagnostic purposes. Topological, metrical and symmetry properties of Oxford, London and Hanoi graphs, the state graphs of the corresponding puzzles, will be displayed. Among these, Hanoi graphs H p , where p stands for the number of pegs and n for the number of discs involved in the TH, have been studied intensely in recent years. For instance, hamiltonicity has been established, planarity settled [1] and issues of distance approached successfully [2]. However, a number of open problems concerning diameters and chromatic indices are left over, some of which can be investigated by computer experiments.
منابع مشابه
Hamiltonianicity of the Towers of Hanoi Problem
In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...
متن کاملAlgorithms and Bounds for Tower of Hanoi Problems on Graphs
The classic Tower of Hanoi puzzle was marketed by Edouard Lucas in 1883 under the name ”Tower of Hanoi” [31]. There, n disks are due to be moved from one peg to another, using an auxiliary peg while never placing a bigger disk above a smaller one. Its optimal solution is classic in Computer Science. In this thesis, we study a generalization of the original puzzle. The problem is generalized by ...
متن کاملMaximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apoll...
متن کاملSchreier Spectrum of the Hanoi Towers Group on Three Pegs
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action o...
متن کاملGraphs S ( n , k ) and a variant of the Tower of Hanoi problem ∗
For any n ≥ 1 and any k ≥ 1, a graph S(n, k) is introduced. Vertices of S(n, k) are n-tuples over {1, 2, . . . , k} and two n-tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs S(n, 3) are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest p...
متن کامل